Fuzzy Clustering by Quadratic Regularization
نویسندگان
چکیده
منابع مشابه
Fuzzy C-Means Clustering With Regularization by K-L Information
Gaussian mixture model or Gaussian mixture density model(GMM) uses the likelihood function as a measure of fit. We show that just the same algorithm as the GMM can be derived from a modified objective function of Fuzzy c-Means (FCM) clustering with the regularizer by K-L information, only when the parameter λ equals 2. Although the fixed-point iteration scheme of FCM is similar to that of the G...
متن کاملFuzzy c-Means Clustering for Uncertain Data Using Quadratic Penalty-Vector Regularization
Clustering – defined as an unsupervised data-analysis classification transforming real-space information into data in pattern space and analyzing it – may require that data be represented by a set, rather than points, due to data uncertainty, e.g., measurement error margin, data regarded as one point, or missing values. These data uncertainties have been represented as interval ranges for which...
متن کاملFuzzy Clustering: Consistency of Entropy Regularization
We introduce in this paper a new formulation of the regularized fuzzy C-means (FCM) algorithm which allows us to find automatically the actual number of clusters. The approach is based on the minimization of an objective function which mixes, via a particular parameter, a classical FCM term and a new entropy regularizer. The main contribution of the method is the introduction of a new exponenti...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملOn Tolerant Fuzzy c-Means Clustering with L1-Regularization
We have proposed tolerant fuzzy c-means clustering (TFCM) from the viewpoint of handling data more flexibly. This paper presents a new type of tolerant fuzzy c-means clustering with L1-regularization. L1-regularization is wellknown as the most successful techniques to induce sparseness. The proposed algorithm is different from the viewpoint of the sparseness for tolerance vector. In the origina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 1998
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.10.5_145